Parallel Load Balancing for Problems with Good Bisectors
نویسندگان
چکیده
Parallel load balancing is studied for problems with certain bisection properties. A class of problems has bisectors if every problem p of weight w(p) in the class can be subdivided into two subproblems whose weight (load) is at least an -fraction of the original problem. A problem p is to be split into N subproblems such that the maximum weight among them is as close to w(p)=N as possible. It was previously known that good load balancing can be achieved for such classes of problems using Algorithm HF, a sequential algorithm that repeatedly bisects the subproblem with maximum weight. Several parallel variants of Algorithm HF are introduced and analyzed with respect to worst-case load imbalance, running-time, and communication overhead. For fixed , all variants have running-time O(logN) and provide constant upper bounds on the worstcase load imbalance. Results of simulation experiments regarding the load balance achieved in the average case are
منابع مشابه
Load Balancing for Problems with Good Bisectors, and Applications in Finite Element Simulations
This paper studies load balancing issues for classes of problems with certain bisection properties. A class of problems has -bisectors if every problem in the class can be subdivided into two subproblems whose weight (i.e. workload) is not smaller than an -fraction of the original problem. It is shown that the maximum weight of a subproblem produced by Algorithm HF, which partitions a given pro...
متن کاملLoad Balancing Using Bisectors - A Tight Average-Case Analysis
In parallel computation we often need an algorithm for dividing one computationally expensive job into a xed number, say N , of subjobs, which can be processed in parallel (with reasonable overhead due to additional communication). In practice it is often easier to repeatedly bisect jobs, i.e., split one job into exactly two subjobs, than to generate N subjobs at once. In order to balance the l...
متن کاملA Hybrid Unconscious Search Algorithm for Mixed-model Assembly Line Balancing Problem with SDST, Parallel Workstation and Learning Effect
Due to the variety of products, simultaneous production of different models has an important role in production systems. Moreover, considering the realistic constraints in designing production lines attracted a lot of attentions in recent researches. Since the assembly line balancing problem is NP-hard, efficient methods are needed to solve this kind of problems. In this study, a new hybrid met...
متن کاملOnline Distribution and Load Balancing Optimization Using the Robin Hood and Johnson Hybrid Algorithm
Proper planning of assembly lines is one of the production managers’ concerns at the tactical level so that it would be possible to use the machine capacity, reduce operating costs and deliver customer orders on time. The lack of an efficient method in balancing assembly line can create threatening problems for manufacturing organizations. The use of assembly line balancing methods cannot balan...
متن کاملCustomized Dynamic Load Balancing for a Network of Workstations
Load balancing involves assigning to each processor work proportional to its performance, thereby minimizing the execution time of a program. Although static load balancing can solve many problems (e.g., those caused by processor heterogeneity and nonuniform loops) for most regular applications, the transient external load due to multiple users on a network of workstations necessitates a dynami...
متن کامل